probFD

python2.7 ../probfd-qcomp19/builds/release64/bin/translate/translate.py domain.pddl p15.pddl
../probfd-qcomp19/builds/release64/bin/downward --sas output.sas --engine fretpi-hdp --heuristic hmax --enable-caching --epsilon 1e-6

Parsing...
Parsing: [0.020s CPU, 0.014s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.002s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.013s wall-clock]
Preparing model... [0.010s CPU, 0.009s wall-clock]
Generated 445 rules.
Computing model... [0.180s CPU, 0.172s wall-clock]
4095 relevant atoms
20916 auxiliary atoms
25011 final queue length
31534 total queue pushes
Completing instantiation... [0.160s CPU, 0.155s wall-clock]
Instantiating: [0.360s CPU, 0.357s wall-clock]
Computing fact groups...
Finding invariants...
8 initial candidates
Finding invariants: [0.000s CPU, 0.007s wall-clock]
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
102 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.000s wall-clock]
Computing fact groups: [0.010s CPU, 0.008s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.007s wall-clock]
Translating task: [0.120s CPU, 0.127s wall-clock]
3470 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
1 propositions removed
Detecting unreachable propositions: [0.080s CPU, 0.076s wall-clock]
Reordering and filtering variables...
103 of 104 variables necessary.
0 of 2 mutex groups necessary.
3143 of 3143 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.020s CPU, 0.019s wall-clock]
Translator variables: 103
Translator derived variables: 0
Translator facts: 210
Translator goal facts: 2
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 3143
Translator axioms: 0
Translator task size: 22586
Translator peak memory: 42620 KB
Writing output... [0.020s CPU, 0.020s wall-clock]
Done! [0.640s CPU, 0.630s wall-clock]	

Warning: :constants specification not allowed here (cf. PDDL BNF)	

reading input... [t=2.9967e-05s]
done reading input! [t=0.00361668s]
variables: 103
goals: 2
actions: 3143
axioms: 0
has conditional effects: 0
reconstructing probabilistic actions... [t=0.00362683s]
done reconstructing probabilistic actions! [t=0.00764613s]
probabilistic actions: 1514 (with 3258 outcomes)
constructing successor generator... [t=0.00780319s]
done constructing successor generator! [t=0.00812152s]
Bytes per state: 16
Property: MaxProb
Preparing hmax dead end detection heuristic... [t=0.00814782s]
hmax initialization done! [t=0.00861935s]
Engine: FRET-pi with HDP
Starting trap elimination heuristic search wrapper...
Initial state reward: 0.451111518254418753
Expansions: 564
Registered states: 1283
Generated states: 2454
Cached transitions: 968
Expansion cache hits: 66362
Transition cache hits: 115289
Approximate transition cache memory usage: 70KB
Solver time: 0.03174061400000000033s
Total time: 0.04040665400000000018s